SSE and SSD: Page-Efficient Searchable Symmetric Encryption

Searchable Symmetric Encryption (SSE) enables a client to outsource database an untrusted server, while retaining the ability securely search data. The performance bottleneck of classic SSE schemes typically does not come from their fast, symmetric cryptographic operations, but rather cost memory accesses. To address this issue, many works in literature have considered notion locality, simple design criterion that helps capture accesses traditional storage media, such as Hard Disk Drives. A common thread among aiming improve locality is they are built on top new allocation schemes, which form technical core constructions. starting observation work for newer media Solid State Drives (SSDs), become increasingly common, good predictor practical performance. Instead, SSD mainly depends page efficiency, is, reading few pages possible. We define notion, and identify problem, Data-Independent Packing (DIP), captures main challenge required build page-efficient SSE. As our result, we storage-efficient data-independent packing scheme, deduce $$\mathsf {Tethys}$$ first scheme achieve at once $$\mathcal {O}(1)$$ efficiency efficiency. result generalization cuckoo hashing items variable size. Practical experiments show approach achieves excellent